The Basis Number of Mycielski ’s Graph for Some Cog- Graphs

نویسندگان

چکیده

Let G = (V, E) be a simple connected graph, then the basis number of is denoted by b(G) and defined least positive integer k such that graph has − fold for it cycle space. In this paper we studied Mycielski’s some cog-special graphs, compute cog-path cog-cycle cog-star cog-wheel graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circular chromatic number for iterated Mycielski graphs

For a graph G, let M(G) denote the Mycielski graph of G. The t-th iterated Mycielski graph of G, M(G), is defined recursively by M0(G) = G and M(G)= M(Mt−1(G)) for t ≥ 1. Let χc(G) denote the circular chromatic number of G. We prove two main results: 1) Assume G has a universal vertex x, then χc(M(G)) = χ(M(G)) if χc(G − x) > χ(G − x) − 1/2 and G is not a star, otherwise χc(M(G)) = χ(M(G)) − 1/...

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel

A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path  $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A  detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex  of at most on...

متن کامل

Circular Chromatic Number and Mycielski Graphs

As a natural generalization of graph coloring, Vince introduced the star chromatic number of a graph G and denoted it by χ∗(G). Later, Zhu called it circular chromatic number and denoted it by χc(G). Let χ(G) be the chromatic number of G. In this paper, it is shown that if the complement of G is non-hamiltonian, then χc(G)=χ(G). Denote by M(G) the Mycielski graph of G. Recursively define Mm(G)=...

متن کامل

Asteroidal number for some product graphs

The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Pure and Applied Mathematics

سال: 2023

ISSN: ['1307-5543']

DOI: https://doi.org/10.29020/nybg.ejpam.v16i2.4704